Deciding whether a relation defined in Presburger logic can be defined in weaker logics
نویسنده
چکیده
We consider logics on Z and N which are weaker than Presburger arithmetic and we settle the following decision problem: given a k-ary relation on Z and N which are first order definable in Presburger arithmetic, are they definable in these weaker logics? These logics, intuitively, are obtained by adding modulo and threshold counting predicates. 1991 Mathematics Subject Classification. 03B10, 68Q70.
منابع مشابه
Weakening Presburger Arithmetic
We consider logics on Z and N which are weaker than Presburger Arithmetic and we settle the following decision problem: given a k-ary relation on Z and N which is first order definable in Presburger Arithmetic, is it definable in these weaker logics? These logics, intuitively, are obtained in two different ways. First by introducing modulo and threshold counting predicates on the difference of ...
متن کاملLTL over integer periodicity constraints
Periodicity constraints are present in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. We introduce the logic PLTL, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. The underlying constra...
متن کاملInessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax
While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propositional dynamic logic (PDL) to MSO over trees, Kracht (1997) noted that there are tree languages that can be defined in MSO that can only be defined in PDL by adding new features whose distribution is predictable. He ...
متن کاملS . Demri LTL over Integer Periodicity Constraints
Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. Although th...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 42 شماره
صفحات -
تاریخ انتشار 2008